On the Inverse Problem of Constructing Symmetric Pentadiagonal Toeplitz Matrices from Three Largest Eigenvalues

نویسندگان

  • MOODY T. CHU
  • FASMA DIELE
  • STEFANIA RAGNI
چکیده

The inverse problem of constructing a symmetric Toeplitz matrix with prescribed eigenvalues has been a challenge both theoretically and computationally in the literature. It is now known in theory that symmetric Toeplitz matrices can have arbitrary real spectra. This paper addresses a similar problem — Can the three largest eigenvalues of symmetric pentadiagonal Toeplitz matrices be arbitrary? Given three real numbers ν ≤ μ ≤ λ, this paper finds that the ratio α = λ−ν μ−ν , including infinity if μ = ν, determines whether there is a symmetric pentadiagonal Toeplitz matrix with ν, μ, and λ as its three largest eigenvalues. It is shown that such a matrix of size n × n does not exist if n is even and α is too large, or if n is odd and α is too close to one. When such a matrix does exist, a numerical method is proposed for the construction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices

We derive upper and lower bounds on the smallest and largest eigenvalues, respectively, of real symmetric Toeplitz matrices. The bounds are rst obtained for positive-deenite matrices and then extended to the general real symmetric case. Our bounds are computed as the roots of rational and polynomial approximations to spectral, or secular, equations. The decomposition of the spectrum into even a...

متن کامل

A New Algorithm for Computing the Determinant and the Inverse of a Pentadiagonal Toeplitz Matrix

An effective numerical algorithm for computing the determinant of a pentadiagonal Toeplitz matrix has been proposed by Xiao-Guang Lv and others [1]. The complexity of the algorithm is (9n + 3). In this paper, a new algorithm with the cost of (4n + 6) is presented to compute the determinant of a pentadiagonal Toeplitz matrix. The inverse of a pentadiagonal Toeplitz matrix is also considered.

متن کامل

On inverse eigenvalue problems for block Toeplitz matrices with Toeplitz blocks

We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplitz matrices with symmetric Toeplitz blocks. It is based upon an algorithm which has been used before by others to solve the inverse eigenvalue problem for general real symmetric matrices and also for Toeplitz matrices. First we expose the structure of the eigenvectors of the so-called generalized c...

متن کامل

Some results on the symmetric doubly stochastic inverse eigenvalue problem

‎The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$‎, ‎to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$‎. ‎If there exists an $ntimes n$ symmetric doubly stochastic ...

متن کامل

Inverse Mode Problem for Real and Symmetric Quadratic Models

Many natural phenomena can be modeled by a second-order dynamical system M ÿ+Cẏ+Ky = f(t), where y(t) stands for an appropriate state variable and M , C, K are time-invariant, real and symmetric matrices. In contrast to the classical inverse vibration problem where a model is to be determined from natural frequencies corresponding to various boundary conditions, the inverse mode problem concern...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005